Computing Small Discrete Logarithms Faster
نویسندگان
چکیده
Computations of small discrete logarithms are feasible even in “secure” groups, and are used as subroutines in several cryptographic protocols in the literature. For example, the Boneh–Goh–Nissim degree2-homomorphic public-key encryption system uses generic square-root discrete-logarithm methods for decryption. This paper shows how to use a small group-specific table to accelerate these subroutines. The cost of setting up the table grows with the table size, but the acceleration also grows with the table size. This paper shows experimentally that computing a discrete logarithm in an interval of order ` takes only 1.93 · ` multiplications on average using a table of size ` precomputed with 1.21 · ` multiplications, and computing a discrete logarithm in a group of order ` takes only 1.77 · ` multiplications on average using a table of size ` precomputed with 1.24 · ` multiplications.
منابع مشابه
On the cubic sieve method for computing discrete logarithms over prime fields
In this paper, we report efficient implementations of the linear sieve and the cubic sieve methods for computing discrete logarithms over prime fields. We demonstrate through empirical performance measures that for a special class of primes the cubic sieve method runs about two times faster than the linear sieve method even in cases of small prime fields of the size about 150 bits. We also prov...
متن کاملWeakness of F36·509 for Discrete Logarithm Cryptography
In 2013, Joux, and then Barbulescu, Gaudry, Joux and Thomé, presented new algorithms for computing discrete logarithms in finite fields of small and medium characteristic. We show that these new algorithms render the finite field F36·509 = F33054 weak for discrete logarithm cryptography in the sense that discrete logarithms in this field can be computed significantly faster than with the previo...
متن کاملFaster Individual Discrete Logarithms with the Qpa and Nfs Variants
Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms known are the Number Field Sieve and its variants (special, high-degree, tower) in large and medium characteristic fields (e.g. GF(p2), GF(p12)); the Function Field Sieve and the Quasi Polynomialtime Algorithm in small characteristic finite fields (e.g. GF(36·509)). The last step of this family...
متن کاملComputing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
The negation map can be used to speed up the computation of elliptic curve discrete logarithms using either the baby-step giant-step algorithm (BSGS) or Pollard rho. Montgomery’s simultaneous modular inversion can also be used to speed up Pollard rho when running many walks in parallel. We generalize these ideas and exploit the fact that for any two elliptic curve points X and Y , we can effici...
متن کاملPerformance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields
It is of interest in cryptographic applications to obtain practical performance improvements for the discrete logarithm problem over prime fields Fp with p of size ≤ 500 bits. The linear sieve and the cubic sieve methods described in Coppersmith, Odlyzko and Schroeppel’s paper [3] are two practical algorithms for computing discrete logarithms over prime fields. The cubic sieve algorithm is asym...
متن کامل